________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 20:21:35
Input Data from:  dataset118.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,168
Average f[i]   :4050
Average g[i,j] :1918,75
Total demand   :11660
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	4000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	2020	1	-1	7	9000


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0    >new incumb.: 2020


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	3040	1	-1	5	15500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  0    >new incumb.: 3040


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	4320	1	-1	9	20000


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  0  1    >new incumb.: 4320


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 34
> Selected Move:	4610	3	7	8	20000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1    >new incumb.: 4610


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 31
> Selected Move:	4610	3	2	3	20000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 37
> Selected Move:	4260	3	9	2	19500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 36
> Selected Move:	4072	3	3	7	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 34
> Selected Move:	4320	3	5	9	18500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 37
> Selected Move:	4272	3	0	4	20100


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 18
> Selected Move:	4272	4	4	8	20100


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 27
> Selected Move:	4080	3	8	0	18500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 34
> Selected Move:	4270	3	4	6	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 37
> Selected Move:	4060	3	7	8	20000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 38
> Selected Move:	4060	3	6	3	17500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 36
> Selected Move:	4060	3	0	4	19100


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 20
> Selected Move:	4060	4	4	2	20000


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 18
> Selected Move:	4060	4	2	3	20000


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 14
> Selected Move:	4060	4	3	8	19100


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 18
> Selected Move:	4060	4	8	9	19600


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 19
> Selected Move:	4117	3	9	5	20100


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 22
> Selected Move:	4060	3	4	9	19600


> New Y[]: 
	
	 0  3  1  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 21
> Selected Move:	4068	3	3	7	20600


> New Y[]: 
	
	 0  3  1  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 31
> Selected Move:	3864	3	9	4	21100


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  1  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 30
> Selected Move:	4074	3	5	9	20600


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 26
> Selected Move:	3956	4	9	7	20900


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,41

## ITERATION 26 #######################


> Neighbours evaluated; 24
> Selected Move:	3910	4	7	2	21000


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,415

## ITERATION 27 #######################


> Neighbours evaluated; 28
> Selected Move:	3840	3	2	0	19500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1 
 > pw :0,42

## ITERATION 28 #######################


> Neighbours evaluated; 24
> Selected Move:	4190	3	4	5	21000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,425

## ITERATION 29 #######################


> Neighbours evaluated; 31
> Selected Move:	3635	3	5	6	21000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1 
 > pw :0,43

## ITERATION 30 #######################


> Neighbours evaluated; 32
> Selected Move:	3970	3	7	3	20000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 31 #######################


> Neighbours evaluated; 35
> Selected Move:	3840	3	6	4	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 32 #######################


> Neighbours evaluated; 32
> Selected Move:	3980	3	8	2	17500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 33 #######################


> Neighbours evaluated; 37
> Selected Move:	4060	3	0	5	19600


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,45

## ITERATION 34 #######################


> Neighbours evaluated; 20
> Selected Move:	3790	4	5	4	20600


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,455

## ITERATION 35 #######################


> Neighbours evaluated; 16
> Selected Move:	4060	3	4	0	19000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 36 #######################


> Neighbours evaluated; 34
> Selected Move:	3790	3	0	8	20600


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,445

## ITERATION 37 #######################


> Neighbours evaluated; 21
> Selected Move:	3671	3	9	4	21100


> New Y[]: 
	
	 0  3  1  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,45

## ITERATION 38 #######################


> Neighbours evaluated; 18
> Selected Move:	3665	4	8	4	21100


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,455

## ITERATION 39 #######################


> Neighbours evaluated; 19
> Selected Move:	3560	3	4	9	21100


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,46

## ITERATION 40 #######################


> Neighbours evaluated; 17
> Selected Move:	3554	3	8	4	21100


> New Y[]: 
	
	 0  3  1  1  1  1  0  0  0  2 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,465

## ITERATION 41 #######################


> Neighbours evaluated; 17
> Selected Move:	3600	3	9	0	19500


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 42 #######################


> Neighbours evaluated; 35
> Selected Move:	3840	3	5	8	18000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 43 #######################


> Neighbours evaluated; 34
> Selected Move:	3840	3	1	9	19700


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 44 #######################


> Neighbours evaluated; 20
> Selected Move:	3840	4	9	4	19900


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 45 #######################


> Neighbours evaluated; 16
> Selected Move:	4060	3	4	5	19900


> New Y[]: 
	
	 2  0  1  1  0  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,49

## ITERATION 46 #######################


> Neighbours evaluated; 22
> Selected Move:	4159	3	3	7	20900


> New Y[]: 
	
	 2  0  1  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,495

## ITERATION 47 #######################


> Neighbours evaluated; 24
> Selected Move:	3808	4	5	7	21600


> New Y[]: 
	
	 2  0  1  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 48 #######################


> Neighbours evaluated; 21
> Selected Move:	3790	3	5	4	20100


> New Y[]: 
	
	 2  0  1  0  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,505

## ITERATION 49 #######################


> Neighbours evaluated; 23
> Selected Move:	3840	3	7	1	18500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 50 #######################


> Neighbours evaluated; 29
> Selected Move:	3840	3	9	7	19000


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 51 #######################


> Neighbours evaluated; 33
> Selected Move:	3812	3	4	6	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 52 #######################


> Neighbours evaluated; 34
> Selected Move:	3730	3	7	3	19500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 53 #######################


> Neighbours evaluated; 34
> Selected Move:	3730	3	8	9	19000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 54 #######################


> Neighbours evaluated; 34
> Selected Move:	3560	3	2	4	20000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,475

## ITERATION 55 #######################


> Neighbours evaluated; 31
> Selected Move:	3600	3	6	5	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,47

## ITERATION 56 #######################


> Neighbours evaluated; 28
> Selected Move:	3600	3	3	2	20000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 57 #######################


> Neighbours evaluated; 31
> Selected Move:	3560	3	5	6	20000


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 58 #######################


> Neighbours evaluated; 33
> Selected Move:	3560	3	9	3	19500


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 59 #######################


> Neighbours evaluated; 34
> Selected Move:	3333	3	2	8	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 60 #######################


> Neighbours evaluated; 30
> Selected Move:	3510	3	6	7	19000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  1  0 
 > pw :0,445

## ITERATION 61 #######################


> Neighbours evaluated; 34
> Selected Move:	3529	3	1	9	20700


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,44

## ITERATION 62 #######################


> Neighbours evaluated; 17
> Selected Move:	3796	4	9	7	20100


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,435

## ITERATION 63 #######################


> Neighbours evaluated; 19
> Selected Move:	3797	3	7	2	20100


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 64 #######################


> Neighbours evaluated; 18
> Selected Move:	3840	4	2	8	19700


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,425

## ITERATION 65 #######################


> Neighbours evaluated; 18
> Selected Move:	3670	4	8	3	20400


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 66 #######################


> Neighbours evaluated; 20
> Selected Move:	3243	3	4	5	21900


> New Y[]: 
	
	 2  0  1  3  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,435

## ITERATION 67 #######################


> Neighbours evaluated; 17
> Selected Move:	3538	4	3	8	21200


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,44

## ITERATION 68 #######################


> Neighbours evaluated; 19
> Selected Move:	3632	3	3	7	22200


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,445

## ITERATION 69 #######################


> Neighbours evaluated; 19
> Selected Move:	3621	4	8	9	22200


> New Y[]: 
	
	 2  0  1  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,45

## ITERATION 70 #######################


> Neighbours evaluated; 20
> Selected Move:	3525	3	5	4	20700


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,455

## ITERATION 71 #######################


> Neighbours evaluated; 19
> Selected Move:	3522	4	9	8	20700


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,46

## ITERATION 72 #######################


> Neighbours evaluated; 19
> Selected Move:	3518	3	2	3	20700


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,465

## ITERATION 73 #######################


> Neighbours evaluated; 18
> Selected Move:	3510	3	8	1	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,47

## ITERATION 74 #######################


> Neighbours evaluated; 31
> Selected Move:	3510	3	4	5	20000


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,475

## ITERATION 75 #######################


> Neighbours evaluated; 34
> Selected Move:	3510	3	5	8	18500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,48

## ITERATION 76 #######################


> Neighbours evaluated; 30
> Selected Move:	3558	3	1	5	20900


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,485

## ITERATION 77 #######################


> Neighbours evaluated; 27
> Selected Move:	3404	3	5	4	20900


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,49

## ITERATION 78 #######################


> Neighbours evaluated; 15
> Selected Move:	3399	3	3	2	20900


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,495

## ITERATION 79 #######################


> Neighbours evaluated; 15
> Selected Move:	3565	3	4	6	21000


> New Y[]: 
	
	 2  0  1  0  0  0  3  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,5

## ITERATION 80 #######################


> Neighbours evaluated; 24
> Selected Move:	3730	3	7	3	20000


> New Y[]: 
	
	 2  0  1  1  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,505

## ITERATION 81 #######################


> Neighbours evaluated; 27
> Selected Move:	3560	3	8	4	20000


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,51

## ITERATION 82 #######################


> Neighbours evaluated; 24
> Selected Move:	3600	3	6	5	19900


> New Y[]: 
	
	 2  0  1  1  1  3  0  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,505

## ITERATION 83 #######################


> Neighbours evaluated; 23
> Selected Move:	3398	3	9	8	20400


> New Y[]: 
	
	 2  0  1  1  1  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 84 #######################


> Neighbours evaluated; 22
> Selected Move:	3305	3	5	6	20500


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 85 #######################


> Neighbours evaluated; 24
> Selected Move:	3045	3	2	9	21000


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,52

## ITERATION 86 #######################


> Neighbours evaluated; 21
> Selected Move:	3132	3	6	5	20900


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,525

## ITERATION 87 #######################


> Neighbours evaluated; 13
> Selected Move:	3128	3	3	2	20900


> New Y[]: 
	
	 2  0  1  0  1  3  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  1 
 > pw :0,53

## ITERATION 88 #######################


> Neighbours evaluated; 18
> Selected Move:	3123	3	8	7	20900


> New Y[]: 
	
	 2  0  1  0  1  3  0  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,535

## ITERATION 89 #######################


> Neighbours evaluated; 20
> Selected Move:	3118	3	2	3	20900


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,54

## ITERATION 90 #######################


> Neighbours evaluated; 21
> Selected Move:	3040	3	4	2	19900


> New Y[]: 
	
	 2  0  1  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,545

## ITERATION 91 #######################


> Neighbours evaluated; 27
> Selected Move:	3040	3	5	1	17500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,55

## ITERATION 92 #######################


> Neighbours evaluated; 29
> Selected Move:	3460	3	2	6	20000


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,555

## ITERATION 93 #######################


> Neighbours evaluated; 31
> Selected Move:	3377	3	7	5	21500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 94 #######################


> Neighbours evaluated; 29
> Selected Move:	3370	3	3	2	21500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 95 #######################


> Neighbours evaluated; 28
> Selected Move:	3200	2	9	-1	17000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 96 #######################


> Neighbours evaluated; 35
> Selected Move:	3600	3	6	8	15500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,575

## ITERATION 97 #######################


> Neighbours evaluated; 32
> Selected Move:	3580	3	5	9	13500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,57

## ITERATION 98 #######################


> Neighbours evaluated; 31
> Selected Move:	3520	3	0	4	15100


> New Y[]: 
	
	 0  3  1  0  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,565

## ITERATION 99 #######################


> Neighbours evaluated; 27
> Selected Move:	3520	4	4	2	16000


> New Y[]: 
	
	 0  3  2  0  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,56

## ITERATION 100 #######################


> Neighbours evaluated; 27
> Selected Move:	3520	4	2	8	15100


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,555

## ITERATION 101 #######################


> Neighbours evaluated; 26
> Selected Move:	3520	4	8	9	15600


> New Y[]: 
	
	 0  3  1  0  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,55

## ITERATION 102 #######################


> Neighbours evaluated; 27
> Selected Move:	3320	3	2	7	16600


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,545

## ITERATION 103 #######################


> Neighbours evaluated; 23
> Selected Move:	3320	4	9	4	16100


> New Y[]: 
	
	 0  3  0  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,54

## ITERATION 104 #######################


> Neighbours evaluated; 23
> Selected Move:	3456	1	-1	3	20100


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,535

## ITERATION 105 #######################


> Neighbours evaluated; 23
> Selected Move:	3456	4	4	8	20100


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,53

## ITERATION 106 #######################


> Neighbours evaluated; 28
> Selected Move:	3320	2	3	-1	16100


> New Y[]: 
	
	 0  3  0  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,525

## ITERATION 107 #######################


> Neighbours evaluated; 21
> Selected Move:	3320	4	8	7	16900


> New Y[]: 
	
	 0  3  0  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,52

## ITERATION 108 #######################


> Neighbours evaluated; 23
> Selected Move:	3310	3	7	3	16000


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,515

## ITERATION 109 #######################


> Neighbours evaluated; 23
> Selected Move:	3310	4	3	4	15100


> New Y[]: 
	
	 0  3  0  1  2  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,51

## ITERATION 110 #######################


> Neighbours evaluated; 12
> Selected Move:	3410	3	4	0	13500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,505

## ITERATION 111 #######################


> Neighbours evaluated; 30
> Selected Move:	3410	3	9	5	15500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 112 #######################


> Neighbours evaluated; 33
> Selected Move:	3350	1	-1	4	20500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 113 #######################


> Neighbours evaluated; 25
> Selected Move:	3352	3	3	2	20500


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 114 #######################


> Neighbours evaluated; 28
> Selected Move:	3355	3	8	7	20500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 115 #######################


> Neighbours evaluated; 28
> Selected Move:	3318	3	5	6	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 116 #######################


> Neighbours evaluated; 30
> Selected Move:	3320	3	7	8	20500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 117 #######################


> Neighbours evaluated; 30
> Selected Move:	3090	3	4	5	22000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,49

## ITERATION 118 #######################


> Neighbours evaluated; 28
> Selected Move:	3290	3	8	7	22000


> New Y[]: 
	
	 2  3  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 119 #######################


> Neighbours evaluated; 27
> Selected Move:	3235	3	7	3	21000


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 120 #######################


> Neighbours evaluated; 30
> Selected Move:	3040	3	5	7	19500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0 
 > pw :0,505

## ITERATION 121 #######################


> Neighbours evaluated; 31
> Selected Move:	3208	3	2	4	20500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,51

## ITERATION 122 #######################


> Neighbours evaluated; 30
> Selected Move:	3255	3	6	5	20500


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,515

## ITERATION 123 #######################


> Neighbours evaluated; 30
> Selected Move:	3252	3	4	8	20500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,52

## ITERATION 124 #######################


> Neighbours evaluated; 30
> Selected Move:	3320	2	3	-1	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,525

## ITERATION 125 #######################


> Neighbours evaluated; 30
> Selected Move:	3320	3	5	9	14500


> New Y[]: 
	
	 2  3  0  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,53

## ITERATION 126 #######################


> Neighbours evaluated; 27
> Selected Move:	3130	3	8	6	16000


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,535

## ITERATION 127 #######################


> Neighbours evaluated; 32
> Selected Move:	3200	3	9	5	18000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,54

## ITERATION 128 #######################


> Neighbours evaluated; 30
> Selected Move:	3040	3	0	2	19500


> New Y[]: 
	
	 0  3  2  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,535

## ITERATION 129 #######################


> Neighbours evaluated; 28
> Selected Move:	3040	4	2	5	17600


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0 
 > pw :0,53

## ITERATION 130 #######################


> Neighbours evaluated; 30
> Selected Move:	3097	1	-1	9	22100


> New Y[]: 
	
	 0  3  1  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,525

## ITERATION 131 #######################


> Neighbours evaluated; 24
> Selected Move:	3745	3	6	4	20600


> New Y[]: 
	
	 0  3  1  0  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,52

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	3958	3	5	6	20600


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,515

## ITERATION 133 #######################


> Neighbours evaluated; 29
> Selected Move:	3771	3	4	8	20600


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,51

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	3730	3	7	3	19600


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,505

## ITERATION 135 #######################


> Neighbours evaluated; 23
> Selected Move:	3730	3	8	4	19600


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,5

## ITERATION 136 #######################


> Neighbours evaluated; 20
> Selected Move:	3680	3	9	8	20100


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  1  0 
 > pw :0,505

## ITERATION 137 #######################


> Neighbours evaluated; 24
> Selected Move:	3507	3	2	9	20600


> New Y[]: 
	
	 0  3  0  1  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,51

## ITERATION 138 #######################


> Neighbours evaluated; 23
> Selected Move:	3754	3	6	5	20600


> New Y[]: 
	
	 0  3  0  1  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 139 #######################


> Neighbours evaluated; 19
> Selected Move:	3751	3	3	2	20600


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 140 #######################


> Neighbours evaluated; 24
> Selected Move:	3498	3	5	6	20600


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,525

## ITERATION 141 #######################


> Neighbours evaluated; 24
> Selected Move:	3232	3	9	7	21100


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  1  0  0 
 > pw :0,53

## ITERATION 142 #######################


> Neighbours evaluated; 27
> Selected Move:	2987	3	4	3	20100


> New Y[]: 
	
	 0  3  1  1  0  0  2  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  1  0 
 > pw :0,535

## ITERATION 143 #######################


> Neighbours evaluated; 29
> Selected Move:	3139	3	2	9	20600


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,54

## ITERATION 144 #######################


> Neighbours evaluated; 25
> Selected Move:	3186	3	6	5	20600


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1 
 > pw :0,545

## ITERATION 145 #######################


> Neighbours evaluated; 28
> Selected Move:	3188	3	3	4	21600


> New Y[]: 
	
	 0  3  0  0  1  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  1  0 
 > pw :0,55

## ITERATION 146 #######################


> Neighbours evaluated; 24
> Selected Move:	3180	3	8	3	20600


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  1  0  0  0  1 
 > pw :0,555

## ITERATION 147 #######################


> Neighbours evaluated; 27
> Selected Move:	3127	3	5	6	20600


> New Y[]: 
	
	 0  3  0  1  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,56

## ITERATION 148 #######################


> Neighbours evaluated; 26
> Selected Move:	3040	3	4	2	19600


> New Y[]: 
	
	 0  3  1  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  1 
 > pw :0,565

## ITERATION 149 #######################


> Neighbours evaluated; 25
> Selected Move:	3108	3	7	5	21100


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,57

## ITERATION 150 #######################


> Neighbours evaluated; 19
> Selected Move:	3103	4	6	5	21100


> New Y[]: 
	
	 0  3  1  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,575

## ITERATION 151 #######################


> Neighbours evaluated; 20
> Selected Move:	3385	3	5	4	20600


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,58

## ITERATION 152 #######################


> Neighbours evaluated; 20
> Selected Move:	3382	3	4	8	20600


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,585

## ITERATION 153 #######################


> Neighbours evaluated; 22
> Selected Move:	3144	3	3	7	21600


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,59

## ITERATION 154 #######################


> Neighbours evaluated; 22
> Selected Move:	3376	3	6	5	21600


> New Y[]: 
	
	 0  3  1  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  1  1 
 > pw :0,595

## ITERATION 155 #######################


> Neighbours evaluated; 24
> Selected Move:	3108	3	7	4	21600


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,6

## ITERATION 156 #######################


> Neighbours evaluated; 22
> Selected Move:	3160	3	8	3	21500


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,605

## ITERATION 157 #######################


> Neighbours evaluated; 15
> Selected Move:	3152	4	3	2	21500


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,61

## ITERATION 158 #######################


> Neighbours evaluated; 16
> Selected Move:	3145	3	4	8	21500


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,615

## ITERATION 159 #######################


> Neighbours evaluated; 16
> Selected Move:	3137	4	2	3	21500


> New Y[]: 
	
	 0  3  1  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  1  0 
 > pw :0,62

## ITERATION 160 #######################


> Neighbours evaluated; 16
> Selected Move:	3068	3	3	4	21600


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0 
 > pw :0,625

## ITERATION 161 #######################


> Neighbours evaluated; 21
> Selected Move:	3060	3	2	3	21600


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,63

## ITERATION 162 #######################


> Neighbours evaluated; 18
> Selected Move:	3052	4	4	8	21600


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,635

## ITERATION 163 #######################


> Neighbours evaluated; 18
> Selected Move:	3310	2	5	-1	15100


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,64

## ITERATION 164 #######################


> Neighbours evaluated; 19
> Selected Move:	3310	4	8	9	15600


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,645

## ITERATION 165 #######################


> Neighbours evaluated; 24
> Selected Move:	3123	1	-1	7	20600


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,65

## ITERATION 166 #######################


> Neighbours evaluated; 20
> Selected Move:	3040	3	4	2	19600


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,655

## ITERATION 167 #######################


> Neighbours evaluated; 24
> Selected Move:	3040	4	9	2	20000


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,66

## ITERATION 168 #######################


> Neighbours evaluated; 19
> Selected Move:	3040	4	2	3	20000


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,665

## ITERATION 169 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	3	7	19900


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,66

## ITERATION 170 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	7	8	19100


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  1 
 > pw :0,655

## ITERATION 171 #######################


> Neighbours evaluated; 20
> Selected Move:	3040	3	8	4	19100


> New Y[]: 
	
	 0  3  1  1  2  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,65

## ITERATION 172 #######################


> Neighbours evaluated; 25
> Selected Move:	3230	3	3	6	21600


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,645

## ITERATION 173 #######################


> Neighbours evaluated; 21
> Selected Move:	3040	2	6	-1	15100


> New Y[]: 
	
	 0  3  1  0  2  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,64

## ITERATION 174 #######################


> Neighbours evaluated; 26
> Selected Move:	3040	4	4	2	16000


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,635

## ITERATION 175 #######################


> Neighbours evaluated; 27
> Selected Move:	3040	4	2	7	15900


> New Y[]: 
	
	 0  3  1  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,63

## ITERATION 176 #######################


> Neighbours evaluated; 26
> Selected Move:	3040	4	7	9	15600


> New Y[]: 
	
	 0  3  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  1 
 > pw :0,625

## ITERATION 177 #######################


> Neighbours evaluated; 26
> Selected Move:	3040	3	1	8	17800


> New Y[]: 
	
	 0  0  1  0  1  0  0  1  3  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,62

## ITERATION 178 #######################


> Neighbours evaluated; 20
> Selected Move:	3040	4	8	2	18200


> New Y[]: 
	
	 0  0  3  0  1  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,615

## ITERATION 179 #######################


> Neighbours evaluated; 19
> Selected Move:	3040	4	2	4	18000


> New Y[]: 
	
	 0  0  1  0  3  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,61

## ITERATION 180 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	4	7	17200


> New Y[]: 
	
	 0  0  1  0  1  0  0  3  1  2 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,605

## ITERATION 181 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	7	9	18100


> New Y[]: 
	
	 0  0  1  0  1  0  0  2  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,6

## ITERATION 182 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	7	2	18200


> New Y[]: 
	
	 0  0  2  0  1  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,595

## ITERATION 183 #######################


> Neighbours evaluated; 17
> Selected Move:	3040	4	2	4	17300


> New Y[]: 
	
	 0  0  1  0  2  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,59

## ITERATION 184 #######################


> Neighbours evaluated; 18
> Selected Move:	3040	4	4	8	17300


> New Y[]: 
	
	 0  0  1  0  1  0  0  1  2  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,585

## ITERATION 185 #######################


> Neighbours evaluated; 17
> Selected Move:	3040	4	9	2	17700


> New Y[]: 
	
	 0  0  3  0  1  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,58

## ITERATION 186 #######################


> Neighbours evaluated; 19
> Selected Move:	3040	4	2	4	17500


> New Y[]: 
	
	 0  0  1  0  3  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,575

## ITERATION 187 #######################


> Neighbours evaluated; 19
> Selected Move:	3040	4	4	7	16700


> New Y[]: 
	
	 0  0  1  0  1  0  0  3  2  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,57

## ITERATION 188 #######################


> Neighbours evaluated; 19
> Selected Move:	3040	4	7	8	18100


> New Y[]: 
	
	 0  0  1  0  1  0  0  2  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,565

## ITERATION 189 #######################


> Neighbours evaluated; 15
> Selected Move:	3040	4	7	2	18200


> New Y[]: 
	
	 0  0  2  0  1  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,56

## ITERATION 190 #######################


> Neighbours evaluated; 14
> Selected Move:	3040	4	2	4	17300


> New Y[]: 
	
	 0  0  1  0  2  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,555

## ITERATION 191 #######################


> Neighbours evaluated; 15
> Selected Move:	3040	4	8	2	17700


> New Y[]: 
	
	 0  0  3  0  2  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,55

## ITERATION 192 #######################


> Neighbours evaluated; 17
> Selected Move:	3040	4	2	4	18400


> New Y[]: 
	
	 0  0  2  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,545

## ITERATION 193 #######################


> Neighbours evaluated; 14
> Selected Move:	3040	4	2	7	18300


> New Y[]: 
	
	 0  0  1  0  3  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,54

## ITERATION 194 #######################


> Neighbours evaluated; 15
> Selected Move:	3040	4	4	2	18500


> New Y[]: 
	
	 0  0  3  0  1  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,535

## ITERATION 195 #######################


> Neighbours evaluated; 14
> Selected Move:	3040	4	2	7	17600


> New Y[]: 
	
	 0  0  2  0  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,53

## ITERATION 196 #######################


> Neighbours evaluated; 13
> Selected Move:	3040	4	2	4	16700


> New Y[]: 
	
	 0  0  1  0  2  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  1  1 
 > pw :0,525

## ITERATION 197 #######################


> Neighbours evaluated; 15
> Selected Move:	3040	3	4	0	15100


> New Y[]: 
	
	 2  0  1  0  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,52

## ITERATION 198 #######################


> Neighbours evaluated; 26
> Selected Move:	3228	1	-1	6	21600


> New Y[]: 
	
	 2  0  1  0  0  0  1  3  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  1 
 > pw :0,515

## ITERATION 199 #######################


> Neighbours evaluated; 25
> Selected Move:	3040	3	6	3	19100


> New Y[]: 
	
	 2  0  1  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,51

## ITERATION 200 #######################


> Neighbours evaluated; 24
> Selected Move:	3174	3	2	5	21600


> New Y[]: 
	
	 2  0  0  1  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,505

## ITERATION 201 #######################


> Neighbours evaluated; 23
> Selected Move:	3252	3	7	2	21600


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,5

## ITERATION 202 #######################


> Neighbours evaluated; 16
> Selected Move:	3460	4	2	9	21200


> New Y[]: 
	
	 2  0  1  1  0  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  1  0 
 > pw :0,495

## ITERATION 203 #######################


> Neighbours evaluated; 22
> Selected Move:	3136	3	5	6	21200


> New Y[]: 
	
	 2  0  1  1  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,5

## ITERATION 204 #######################


> Neighbours evaluated; 24
> Selected Move:	3130	4	9	8	21200


> New Y[]: 
	
	 2  0  1  1  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  1 
 > pw :0,505
________________________________________________________________

Best solution found: 4610
Run Termination time: 03.02.2010 20:22:35
Run duration: 00:01:00.1875000
________________________________________________________________
